Performance Analysis of Parallel Pollard's Rho Factoring Algorithm

Performance Analysis of Parallel Pollard's Rho Algorithm

Integer factorization is one of the vital algorithms discussed as a part of analysis of any black-box cipher suites where the cipher algorithm is based on number theory. The origin of the problem is from Discrete Logarithmic Problem which appears under the analysis of the cryptographic algorithms as seen by a cryptanalyst. The integer factorization algorithm poses a potential in computational s...

Implementing the Continued Fraction Factoring Algorithm on Parallel Machines

An implementation is described of the continued fraction factoring algorithm on the DAP parallel processor located in Queen Mary College in London. The DAP has 4096 parallel processors each containing 16K bits of memory and the suggested implementation incorporates the early abort strategy and the large prime variation. Introduction. There are several good general factoring methods (i.e., metho...

Performance Analysis Issues for Parallel Implementations of Propagation Algorithm

This paper presents a theoretical study to evaluate the performance of a family of parallel implementations of the propagation algorithm. The propagation algorithm is used to an image interpolation application. The theoretical performance analysis is based on the construction of generic models using Stochastic Automata Networks (SAN) formalism to describe each implementation scheme. The predict...

Performance analysis of a pipelined backpropagation parallel algorithm

The supervised training of feedforward neural networks is often based on the error backpropagation algorithm. The authors consider the successive layers of a feedforward neural network as the stages of a pipeline which is used to improve the efficiency of the parallel algorithm. A simple placement rule is used to take advantage of simultaneous executions of the calculations on each layer of the...

RAK factoring algorithm